Adaptable and conflict colouring multigraphs with no cycles of length three or four
نویسندگان
چکیده
The adaptable choosability of a multigraph G $G$ , denoted ch ( ) ${\text{ch}}_{a}(G)$ is the smallest integer k $k$ such that any edge labelling, τ $\tau $ and assignment lists size to vertices permits list colouring, σ $\sigma there no e = u v $e=uv$ where (e)=\sigma (u)=\sigma (v)$ . Here we show for with maximum degree Δ ${\rm{\Delta }}$ cycles length 3 or 4, ≤ 2 + o 1 ∕ ln ${\text{ch}}_{a}(G)\,\le (2\sqrt{2}+o(1))\sqrt{{\rm{\Delta }}\unicode{x02215}\mathrm{ln}\unicode{x0200A}{\rm{\Delta }}}$ Under natural restrictions can same bound holds conflict which closely related parameter recently defined by Dvořák, Esperet, Kang Ozeki.
منابع مشابه
An edge colouring of multigraphs
We consider a strict k-colouring of a multigraph G as a surjection f from the vertex set of G into a set of colours {1,2,. . . ,k} such that, for every non-pendant vertex x of G, there exist at least two edges incident to x and coloured by the same colour. The maximum number of colours in a strict edge colouring of G is called the upper chromatic index of G and is denoted by χ(G). In this paper...
متن کاملExtremal graphs without three-cycles or four-cycles
We derive bounds for f(v), the maximum number of edges in a graph on v vertices that contains neither three-cycles nor four-cycles. Also, we give the exact value of f(v) for all v up to 24 and constructive lower bounds for all v up to 200.
متن کاملOn Tactical Configurations with No Four-Cycles
An improved lower bound is given for the band sizes of tactical configurations of rank exceeding two having no 4-cycles. This bound is applied to find an optimal configuration with certain specified parameters. A formula is given for the maximum number of cycle types one must examine to demonstrate that a rank Y configuration has no g-cycle. This result, which has appeared in our earlier work a...
متن کاملAdaptable Colouring of Graph Products
A colouring of the vertices of a graph (or hypergraph) G is adapted to a given colouring of the edges of G if no edge has the same colour as both (or all) its vertices. The adaptable chromatic number of G is the smallest integer k such that each edge-colouring of G by colours 1, 2, . . . , k admits an adapted vertex-colouring of G by the same colours 1, 2, . . . , k. (The adaptable chromatic nu...
متن کاملCycles and paths in multigraphs
We consider cycles and paths in multigraphic realizations of a degree sequence Q. in particular we show that there exists a realization of d in which no cycle has order greater than three and no path has length greater than four. In addition we show which orders of cycles and which lengths of paths exist in some realization of d.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2023
ISSN: ['0364-9024', '1097-0118']
DOI: https://doi.org/10.1002/jgt.22956